MR Image Reconstruction from Pseudo-Hex Lattice Sampling Patterns Using Separable FFT

نویسندگان

  • Jae-Ho Kim
  • Fred L. Fontaine
چکیده

— Common MRI sampling patterns in kspace, such as spiral trajectories, have nonuniform density and do not lie on a rectangular grid. We propose mapping the sampled data to a pseudo-hex lattice, taking advantage of its approximate isotropic nature in k-space and square nature in the reconstructed image space. The group structure of the lattice is exploited to implement the Fourier transform computations on the data using a separable FFT algorithm, which provides signi…cant computational ef…ciency. We suggest this method can be generalized to multiresolution lattices, in which the signal is represented in di¤erent regions in k-space with varying sampling densities. The operations on index sets and mapping to separable FFT can be implemented e¢ ciently in software or custom hardware (e.g., FPGA).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE COOPER UNION FOR THE ADVANCEMENT OF SCIENCE AND ART ALBERT NERKEN SCHOOL OF ENGINEERING Multiresolution MR Image Reconstruction from a Pseudo-Hex Lattice using Separable DID-DIS FFT

Common MRI sampling patterns in k-space, such as spiral trajectories, have nonuniform density and do not lie on a cartesian grid. This paper illustrates that the sampled data on a spiral trajectory can be e¢ ciently regridded onto a pseudohexagonal lattice using a nearest neighbor regridding algorithm. Also, it is shown that separable FFT using cartesian indices can be used to compute the DFT o...

متن کامل

MR Image Reconstruction Using the GPU

Magnetic resonance (MR) image reconstruction has reached a bottleneck where further speed improvement from the algorithmic perspective is difficult. However, some clinical practices such as real-time surgery monitoring demand faster reconstruction than what is currently available. For such dynamic imaging applications, radial sampling in k -space (i.e. projection acquisition) recently revives d...

متن کامل

Non-quadratic convex regularized reconstruction of MR images from spiral acquisitions

Combining fast MR acquisition sequences and high resolution imaging is a major issue in dynamic imaging. Reducing the acquisition time can be achieved by using non-Cartesian and sparse acquisitions. The reconstruction of MR images from these measurements is generally carried out using gridding that interpolates the missing data to obtain a dense Cartesian k-space filling. The MR image is then r...

متن کامل

Uniform Sampling and Reconstruction of Trivariate Functions

The Body Centered Cubic (BCC) and Face Centered Cubic (FCC) lattices have been known to outperform the commonly-used Cartesian sampling lattice due to their improved spectral sphere packing properties. However, the Cartesian lattice has been widely used for sampling of trivariate functions with applications in areas such as biomedical imaging, scientific data visualization and computer graphics...

متن کامل

Prospective Snr Optimization in K-t-based Sensitivity-encoded Dynamic Imaging Using a Fast Geometric Algorithm

Introduction MR data acquisition and image reconstruction are typically formulated using Fourier transform (FT) theory, i.e., the classical k-space relationship. However, in dynamic MR imaging (e.g., 2D Cartesian sampling) it takes a few milliseconds from collecting one k-space phase-encode (PE) line to the next, i.e., sampling in the PE direction is time-sequential and not instantaneous [1]. H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007